Geometric Hitting Set and Set Cover Problem with Half-Strips
نویسندگان
چکیده
We show that hitting set and set cover problems with half-strips oriented in two opposite directions are NPcomplete.
منابع مشابه
Duality for Geometric Set Cover and Geometric Hitting Set Problems on Pseudodisks
Given an instance of a geometric set cover problem on a set of points X and a set of objects R, the dual is a geometric hitting set problem on a set of points P and a set of objects Q, where there exists a one-to-one mapping from each xj ∈ X to a dual object Qj ∈ Q and for each Ri ∈ R to a dual point in pi ∈ P , so that a dual point pi is contained in a dual object Qj if and only if the corresp...
متن کاملExploiting the Hitting Set Technique by Meta Planning
Expressiveness and eeciency are two main points which determine the quality of a planning system. But improving one aspect usually results in worsening of the other one. In 5], we introduced a new planning paradigm called consistency driven planning (CDP). It allows the usage of general formulas for the description of planning domains. Hence, we enhanced expressiveness over STRIPS-like language...
متن کاملImproved Results on Geometric Hitting Set Problems
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of points that hit all geometric objects. The problem is known to be strongly NP-hard even for simple geometric objects like unit disks in the plane. Therefore, unless P=NP, it is not possible to get Fully Polynomial Time ...
متن کاملHitting and Piercing Rectangles Induced by a Point Set
We consider various hitting and piercing problems for the family of axis-parallel rectangles induced by a point set. Selection Lemmas on induced objects are classical results in discrete geometry that have been well studied and have applications in many geometric problems like weak epsilon nets and slimming Delaunay triangulations. Selection Lemma type results typically bound the maximum number...
متن کاملOutput-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
We give a general framework for the problem of finding all minimal hitting sets of a family of objects in R by another. We apply this framework to the following problems: (i) hitting hyper-rectangles by points in R; (ii) stabbing connected objects by axis-parallel hyperplanes in R; and (iii) hitting half-planes by points. For both the covering and hitting set versions, we obtain incremental pol...
متن کامل